Boolean-rank-preserving operators and Boolean-rank-1 spaces
نویسندگان
چکیده
منابع مشابه
Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1
We show that there is a computable Boolean algebra B and a computably enu-merable ideal I of B such that the quotient algebra B=I is of Cantor{Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of innnite Cantor{Bendixson rank.
متن کاملCdmtcs Research Report Series Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1 Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1
We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B=I is of Cantor{Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of in nite Cantor{Bendixson rank.
متن کاملFinite Rank Toeplitz Operators in Bergman Spaces
We discuss resent developments in the problem of description of finite rank Toeplitz operators in different Bergman spaces and give some applications
متن کاملBoolean Metric Spaces and Boolean Algebraic Varieties
The concepts of Boolean metric space and convex combination are used to characterize polynomial maps An −→ Am in a class of commutative Von Neumann regular rings including p-rings, that we have called CFG-rings. In those rings, the study of the category of algebraic varieties (i.e. sets of solutions to a finite number of polynomial equations with polynomial maps as morphisms) is equivalent to t...
متن کاملDecompositions of the Boolean Lattice into Rank-symmetric Chains
The Boolean lattice 2[n] is the power set of [n] ordered by inclusion. A chain c0 ⊂ · · · ⊂ ck in 2[n] is rank-symmetric, if |ci|+ |ck−i| = n for i = 0, . . . , k; and it is symmetric, if |ci| = (n− k)/2 + i. We prove that there exist a bijection p : [n] → [n] and a partial ordering < on [n](>n/2) satisfying the following properties: • ⊂ is an extension of < on [n](>n/2); • if C ⊂ [n](>n/2) is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1984
ISSN: 0024-3795
DOI: 10.1016/0024-3795(84)90158-7